|
The 1-2-AX working memory task is a task which requires working memory to be solved. It can be used as a test case for learning algorithms to test their ability to remember some old data. This task can be used to demonstrate the working memory abilities of algorithms like PBWM or LSTM. It is an extension of the A-X version of the continuous performance task. ==Description== The input of the task is a sequence of the numbers/letters ''1'', ''2'', ''A'', ''X'', ''B'', ''Y''. And additional ''C'' and ''Z'' which should be ignored. The output is a sequence of the letters ''L'' and ''R'' — one letter for each input letter (except for ''C'' or ''Z''). The output ''R'' should be returned if and only if there is a matching of any trailing part of the input sequence to the regular expression "1() *A() *X" or "2() *B() *Y". Otherwise (except for ''C'' or ''Z''), an ''L'' should be returned. In other words, ''C'' and ''Z'' are completely ignored. The sequence ''A-X'' or ''B-Y'' is accepted (with an ''R'') depending if the most recent number was a ''1'' or a ''2''. Otherwise, an ''L'' is returned. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「1-2-AX working memory task」の詳細全文を読む スポンサード リンク
|